Influence maximization algorithm based on Gaussian propagation model
نویسندگان
چکیده
منابع مشابه
mortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولRegion Extraction Based on Belief Propagation for Gaussian Model
We show a fast algorithm for region extraction based on belief propagation with loopy networks. The solution to this region segmentation problem, which includes the region extraction problem, is of significant computational cost if a conventional iterative approach or statistical sampling methods are applied. In the proposed approach, Gaussian loopy belief propagation is applied to a continuous...
متن کاملAn Expectation-Maximization algorithm for Learning the Latent Gaussian Model with Gaussian Likelihood
In this note, we derive an expectation-maximization (EM) algorithm for a latent Gaussian model with Gaussian likelihood. This model contains many popular models as a special case, such as factor analysis and linear regression. Our derived EM algorithm is general, and contains almost all the updates required for the special cases. We also describe modification of the algorithm in the presence of...
متن کاملStraight-based voice conversion algorithm based on Gaussian mixture model
The voice conversion algorithm based on the Gaussian mixture model (GMM) has also been proposed by Stylianou et al. In this algorithm, the acoustic space of a speaker is represented continuously. In this paper, we apply this GMMbased voice conversion algorithm to STRAIGHT proposed by Kawahara et al., which is recognized as a high quality vocoder. In order to evaluate this voice conversion algor...
متن کاملA Novel Evolutionary Clustering Algorithm Based on Gaussian Mixture Model
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. Traditional clustering algorithms usually predefine the number of clusters via random selection or contend based knowledge. An improper pre-selection for the number of clusters may easily lead to bad clustering outcome. In order to address this issue we propose in this paper a new ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: 0020-0255
DOI: 10.1016/j.ins.2021.04.061